Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowedAZIZOGLU, M; KOKSALAN, M; KOKSALAN, S. K et al.The Journal of the Operational Research Society. 2003, Vol 54, Num 6, pp 661-664, issn 0160-5682, 4 p.Article

A variation of the assignment problemGEETHA, S; NAIR, K. P. K.European journal of operational research. 1993, Vol 68, Num 3, pp 422-426, issn 0377-2217Article

Approximation results for a bicriteria job scheduling problem on a single machine without preemptionANGEL, Eric; BAMPIS, Evripidis; GOURVES, Laurent et al.Information processing letters. 2005, Vol 94, Num 1, pp 19-27, issn 0020-0190, 9 p.Article

A note on solving bicriteria linear programming problems using single criteria softwarePRASAD, S. Y; KARWAN, M. H.Computers & operations research. 1992, Vol 19, Num 2, pp 169-173, issn 0305-0548Article

Finding non-dominated bicriteria shortest pairs of disjoint simple pathsCLIMACO, Joao C. N; PASCOAL, Marta M. B.Computers & operations research. 2009, Vol 36, Num 11, pp 2892-2898, issn 0305-0548, 7 p.Article

Bounded-hops power assignment in ad hoc wireless networksCALINESCU, G; KAPOOR, S; SARWAT, M et al.Discrete applied mathematics. 2006, Vol 154, Num 9, pp 1358-1371, issn 0166-218X, 14 p.Conference Paper

Competitive algorithms for the bicriteria k-server problemFLAMMINI, Michele; NICOSIA, Gaia.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2117-2127, issn 0166-218X, 11 p.Conference Paper

Comments on A bicriteria flowshop scheduling problem with setup timesDEHUA XU; YUNQIANG YIN.Applied mathematics and computation. 2011, Vol 217, Num 17, pp 7361-7364, issn 0096-3003, 4 p.Article

Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespanAL-ANZI, Fawaz S; ALLAHVERDI, Ali.Computers & operations research. 2009, Vol 36, Num 9, pp 2682-2689, issn 0305-0548, 8 p.Article

Single machine scheduling with maximum earliness and number tardyAZIZOGLU, Meral; KONDAKCI, Suna; KÖKSALAN, Murat et al.Computers & industrial engineering. 2003, Vol 45, Num 2, pp 257-268, issn 0360-8352, 12 p.Article

A bicriteria flowshop scheduling problem with setup timesEREN, Tamer; GÜNER, Ertan.Applied mathematics and computation. 2006, Vol 183, Num 2, pp 1292-1300, issn 0096-3003, 9 p.Article

Comments on A bicriteria m-machine flowshop scheduling with sequence-dependent setup timesDEHUA XU; YUNQIANG YIN.Applied mathematical modelling. 2011, Vol 35, Num 7, pp 3639-3643, issn 0307-904X, 5 p.Article

Comments on A bicriteria parallel machine scheduling with a learning effect of setup and removal timesDEHUA XU; YUNQIANG YIN.Applied mathematical modelling. 2011, Vol 35, Num 7, pp 3648-3650, issn 0307-904X, 3 p.Article

Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardinessRUIZ, Rubén; ALLAHVERDI, Ali.Computers & operations research. 2009, Vol 36, Num 4, pp 1268-1283, issn 0305-0548, 16 p.Article

A note on bicriteria schedules with optimal approximations ratiosBAILLE, Fabien; BAMPIS, Evripidis; LAFOREST, Christian et al.Parallel processing letters. 2004, Vol 14, Num 2, pp 315-323, issn 0129-6264, 9 p.Article

Efficiency and approachability of nonconvex bicriteria programsHUANG, X. X; YANG, X. Q.Journal of mathematical analysis and applications. 2001, Vol 261, Num 1, pp 134-150, issn 0022-247XArticle

A bicriteria m-machine flowshop scheduling with sequence-dependent setup timesEREN, Tamer.Applied mathematical modelling. 2010, Vol 34, Num 2, pp 284-293, issn 0307-904X, 10 p.Article

A bicriteria parallel machine scheduling with a learning effect of setup and removal timesEREN, Tamer.Applied mathematical modelling. 2009, Vol 33, Num 2, pp 1141-1150, issn 0307-904X, 10 p.Article

A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problemVILCOT, Geoffrey; BILLAUT, Jean-Charles.European journal of operational research. 2008, Vol 190, Num 2, pp 398-411, issn 0377-2217, 14 p.Article

A bicriteria scheduling with sequence-dependent setup timesEREN, Tamer; GÜNER, Ertan.Applied mathematics and computation. 2006, Vol 179, Num 1, pp 378-385, issn 0096-3003, 8 p.Article

A geometrical solution for quadratic bicriteria location modelsOHSAWA, Y.European journal of operational research. 1999, Vol 114, Num 2, pp 380-388, issn 0377-2217Article

Approximating the degree-bounded minimum diameter spanning tree problemKÖNEMANN, Jochen; LEVIN, Asaf; SINHA, Amitabh et al.Algorithmica. 2005, Vol 41, Num 2, pp 117-129, issn 0178-4617, 13 p.Article

Punctuality and idleness in just-in-time schedulingSOURD, Francis.European journal of operational research. 2005, Vol 167, Num 3, pp 739-751, issn 0377-2217, 13 p.Article

Minimum cost path problems with relaysLAPORTE, Gilbert; PASCOAL, Marta M. B.Computers & operations research. 2011, Vol 38, Num 1, pp 165-173, issn 0305-0548, 9 p.Article

Approximation algorithms for the bi-criteria weighted MAX-CUT problemANGEL, Eric; BAMPIS, Evripidis; GOURVES, Laurent et al.Discrete applied mathematics. 2006, Vol 154, Num 12, pp 1685-1692, issn 0166-218X, 8 p.Article